Convex Hull

An improved image recognition and registration algorithm based on convex hull and affine invariant was presented.

提出了一种新的基于凸壳和仿射不变量的图像识别和配准的方法.

In practice, ROC Convex Hull ( ROCCH ) method which combines techniques from computational geometry is used.

在实际应用中, 基于样本数据集,通过计算几何的方式得到ROC凸包曲线 ( ROCCH ) .

Wang Zi Qiang et al presented a new algorithm for computing the convex hull of a planar point set in 1998, and claimed that the worst case time complexity of the algorithm is O ( n), which can lead to a linear time algorithm for sorting.

王志强等于1998年提出了一个计算平面点集凸包的新算法，并且声称该算法的最坏时间复杂度为O（n），从而为线性时间排序提供了可能性。

Classic convex hull algorithm. JAVA language. Absolutely correct.

经典的凸包算法. JAVA语言编写. 绝对正确.

Presents an algorithm for determining the convex hull of a finite set of points in a plane. The algorithm requires O ( n) multi-plications and O ( nlogn) comparisons.

提出了一种求平面有限点集凸壳顶点的算法，并分析出该算法的时间复杂性是线性次乘法和O（nlogn）次两个数的比较。

That is multi-direction extreme value approximate convex hull algorithm, and is called MDEV for short.

提出并实现了平面点集凸壳的一种新的近似算法 —— 多方向极值法.

Relying on the theorem of Graham, the sample points are realized the minimal convex hull which computational complexity is O ( NlogN).

根据凸包生成算法原理，用Graham算法实现散乱样本的最小凸包，算法复杂度为O（NlogN）。

Being a basic structure of computational geometry, convex hull is important to data analysis of GIS.

凸壳作为计算几何的一种基本的结构,对GIS的数据分析有着重要作用.

At the same time it has the local controllability inherited from convex hull.

同时,它天然继承凸壳的局部性特点.

They are as follow, an optimal algorithm for determining the convex hull of a finite planar point set, an algorithm for triangulation of planar point-set in O ( nlogn) time, the fast algorithm for Delaunay triangulation of simple polygon based on maximum triangle weights.

它们分别是求平面点集凸壳的格雷厄姆方法的一个改进算法，一种时间复杂度为O（nlogn）的平面点集三角剖分算法和简单多边形快速Delaunay三角剖分算法。